Some new optimum Golomb rulers
نویسنده
چکیده
0 Theorem 4, unlike Theorem 2, is not a s'pecial case of a known general result: it is not known if the statement of Theorem 4 holds for twoaccess channels that are not pairwise reversible. There is a converse to Theorem 4: For any fixed rate strictly inside R o , there exists a code with that rate for which X I 1 + o(N). This result holds for general twoaccess channels, and is proved by random-coding [9], [lo]. Thus for PR twoaccess channels , R,, is the critical region for A. (Whether the same holds in general remains unsettled.) We have defined R,, as the union of an uncountable number of regions. Unfortunately no simpler characterization of R, (such as the single-letter characterization that exists in the case of ordinary channels) has been found. The difficulty here is that for twoaccess channels no analog of Lemma 2 exists. For more on open problems in this area, see [lo] and [8]. code has rate 2 (R I , R r)). Iv. APPLICATIONS TO SEQUENTIAL DECODING Consider sequential decoding of a tree code on a one-user channel. Assume that the tree code is infinite in length and that each path in the tree is equally likely to be the true (transmitted) path. Let C, denote the expected number of computational steps for the sequential decoder to decode correctly the first N branches of the tree code. We take the asymptotic value of C,/N as a measure of complexity for sequential decoding. We say that a rate R is achievable by sequential decoding if there exists a tree code with rate R for which C , / N remains bounded as N goes to infinity. The supremum of achievable rates is called the cutoff rate and denoted by RLonlp. The link between the complexity of sequential decoding and lower bounds to X is established by the following idea of [4]. Lemma 4: Consider a sequence of block codes obtained by truncating a given tree code at level N, N 21. Let A, denote the average list size for the Nth code in this sequence. Then I CN/N 2 XN/2. (22) This lemma and Theorem 2 imply that, for sequential decoding on ordinary PR channels at rates R > R,, C,/N goes to infinity with increasing N. This implies in turn that for such channels For all one-user channels (pairwise reversible or not), …
منابع مشابه
On the Design of Optimum Order 2 Golomb Ruler
A Golomb ruler with M marks can be defined as a set {ai} of integers so that all differences δij = aj − ai, i 6= j, are distinct. An order 2 Golomb ruler is a Golomb ruler such that all differences δijk` = |δk` − δij |, {i, j} 6 = {k, `}, are distinct as much as possible. Contruction of optimum order 2 Golomb ruler, i.e., of rulers of minimum length, is a highly combinatorial problem which has ...
متن کاملA review of the available construction methods for Golomb rulers
We collect the main construction methods for Golomb rulers available in the literature along with their proofs. In particular, we demonstrate that the Bose-Chowla method yields Golomb rulers that appear as the main diagonal of a special subfamily of Golomb Costas arrays. We also show that Golomb rulers can be composed to yield longer Golomb rulers.
متن کاملConstructing Optimal Golomb Rulers in Parallel
In this paper, a construction of the Golomb optimal rulers is studied with a tree search approach. Improvements to the basic algorithm are given and it is parallelized using a shared memory. The application associated to this approach is written in C using the standard OpenMP and MPI libraries. The algorithm takes advantage of a collaboration mechanism between the processors. Different load bal...
متن کاملGolomb Rulers: The Advantage of Evolution
In this paper we present a new evolutionary algorithm designed to efficiently search for optimal Golomb rulers. The proposed approach uses a redundant random keys representation to codify the information contained in a chromosome and relies on a simple interpretation algorithm to obtain feasible solutions. Experimental results show that this method is successful in quickly identifying good solu...
متن کاملEnumeration of Golomb Rulers and Acyclic Orientations of Mixed Graphs
A Golomb ruler is a sequence of distinct integers (the markings of the ruler) whose pairwise differences are distinct. Golomb rulers, also known as Sidon sets and B2 sets, can be traced back to additive number theory in the 1930s and have attracted recent research activities on existence problems, such as the search for optimal Golomb rulers (those of minimal length given a fixed number of mark...
متن کاملGenetic Algorithm Approach to the Search for Golomb Rulers
GOLOMB RULERS Stephen W. Soliday soliday@gar eld.ncat.edu Abdollah Homaifar homaifar@gar eld.ncat.edu Department of Electrical Engineering North Carolina A&T State University Greensboro, North Carolina 27411 Gary L. Lebby lebby@gar eld.ncat.edu Abstract The success of genetic algorithm in nding relatively good solutions to NP-complete problems such as the traveling salesman problem and job-shop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 36 شماره
صفحات -
تاریخ انتشار 1990